From coin tossing to rock-paper-scissors and beyond: a log-exp gap theorem for selecting a leader
نویسندگان
چکیده
A class of games for finding a leader among a group of candidates is studied in detail. This class covers games based on coin-tossing and rock-paper-scissors as special cases and its complexity exhibits similar stochastic behaviors: either of logarithmic mean and bounded variance or of exponential mean and exponential variance. Many applications are also discussed.
منابع مشابه
CS261: A Second Course in Algorithms Lecture #10: The Minimax Theorem and Algorithms for Linear Programming∗
Recall rock-paper-scissors (or roshambo). Two players simultaneously choose one of rock, paper, or scissors, with rock beating scissors, scissors beating paper, and paper beating rock. Here’s an idea: what if I made you go first? That’s obviously unfair — whatever you do, I can respond with the winning move. But what if I only forced you to commit to a probability distribution over rock, paper,...
متن کاملA Fully Integrated Method for Dynamic Rock Type Characterization Development in One of Iranian Off-Shore Oil Reservoir
Rock selection in modeling and simulation studies is usually based on two techniques; routinely defined rock types and those defined by special core analysis (SCAL). The challenge in utilizing these two techniques is that they are frequently assumed to be the same, but in practice, static rock-types (routinely defined) are not always representative of dynamic rock-types (SCAL defined) in the re...
متن کاملOn the Black-Box Complexity of Optimally-Fair Coin Tossing
A fair two-party coin tossing protocol is one in which both parties output the same bit that is almost uniformly distributed (i.e., it equals 0 and 1 with probability that is at most negligibly far from one half). It is well known that it is impossible to achieve fair coin tossing even in the presence of fail-stop adversaries (Cleve, FOCS 1986). In fact, Cleve showed that for every coin tossing...
متن کاملQuantum And Relativistic Protocols For Secure Multi-Party Computation
Secure multi-party computation is a task whereby mistrustful parties attempt to compute some joint function of their private data in such a way as to reveal as little as possible about it. It encompasses many cryptographic primitives, including coin tossing and oblivious transfer. Ideally, one would like to generate either a protocol or a no-go theorem for any such task. Very few computations o...
متن کاملProtocols for Multiparty Coin Toss with Dishonest Majority
Coin-tossing protocols are protocols that generate a random bit with uniform distribution. These protocols are used as a building block in many cryptographic protocols. Cleve [STOC 1986] has shown that if at least half of the parties can be malicious, then, in any r-round coin-tossing protocol, the malicious parties can cause a bias of Ω(1/r) to the bit that the honest parties output. However, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Applied Probability
دوره 54 شماره
صفحات -
تاریخ انتشار 2017